tree n. 特里〔姓氏〕。 n. 1.树〔主要指乔木,也可指较大的灌木〕。 ★玫瑰可以称为 bush, 也可以称为 tree. 2.木料,木材;木构件;〔古语〕绞首台;〔the tree〕(钉死耶稣的)十字架;鞋楦。 3.树形(物),世系图,家系 (=family tree);【数学】树(形);【化学】树状晶体。 a banana tree 香蕉树。 an axle-tree 心棒,轴料。 a boot-tree 靴楦[型]。 a saddle-tree 鞍架。 at the top of the tree 在最高地位。 tree of Buddha 菩提树。 tree of heaven 臭椿。 tree of knowledge (of good and evil) 【圣经】知道善恶的树,智慧之树。 tree of life 生命之树,生命力的源泉【植物;植物学】金钟柏。 up a tree 〔口语〕进退两难,不知所措。 vt. 赶(猎兽等)上树躲避;〔口语〕使处于困境;穷追;把鞋型插入(鞋内)。
Different from the previous work , kf - diff + is tailored to both ordered trees and unordered trees . while dealing with the key path , the notion of the key constraint for semi - structure data and the notion of the multi - instance based keys are identified , which will greatly simplify the complexity of the algorithm 在特征路径相关的计算中,本文引入面向半结构数据的key约束思想,并且针对先前判定算法过于复杂的问题,提出了基于多实例结点集合的key约束的概念以及相关的处理方法,在一定程度上简化了计算。
To the former one , since most previous work depends on the signature of nodes , which would be costly to be computed , a new way is proposed to discriminate those nodes that have the same paths in the intrinsic properties of the xml document . towards this end , the thesis introduces a series of notions related to the key path , which make the change detection of xml document easier . based on the notions , a change detection algorithm named kf - diff is presented , which is tailored to unordered trees 对于前者,针对已有算法大多依赖非常耗时的结点签名,并且算法过程复杂的问题,本文提出了一种文档变化检测的处理方法,该方法利用文档固有信息建立特征参照体系,通过特征路径相关的一系列概念的引入,将传统标号树匹配问题转化为无重复路径的标号树匹配问题,有效地解决了路径等价类比较的问题,简化了xml文档的比较。